Automorphisms of Free Groups Have Finitely Generated Fixed Point Sets

نویسنده

  • DARYL COOPER
چکیده

An automorphism of a finitely generated free group F extends to a homeomorphism of the end completion E of F. The set of fixed points of this homeomorphism is finitely generated in a certain sense. In particular this implies that the subgroup of elements fixed by the automorphism is finitely generated in the usual sense. The emphasis on E instead of F in this paper is analogous to Thurston’s study of surface groups where measured laminations are studied instead of simple closed curves. The techniques in this paper arose from a study of the behaviour of an automorphism under iteration, that is, the dynamics of the automorphism; see [ 11. I thank Bill Thurston for explaining some of his ideas to me for analysing automorphisms of free groups. In particular the result on bounded cancellation below is due to Thurston and Matt Grayson. Peter Scott asked whether the fixed subgroup is always finitely generated in [3], and Gersten first answered this question in [2] using quite different methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Remarks on Commuting Fixed Point Free Automorphisms of Groups

In this a‌r‌t‌i‌c‌l‌e we will find n‌e‌c‌e‌s‌s‌a‌r‌y and s‌u‌f‌f‌i‌c‌i‌e‌n‌t c‌o‌n‌d‌i‌t‌i‌o‌n‌s for a f‌i‌x‌e‌d  p‌o‌i‌n‌t f‌r‌e‌e autom‌o‌r‌p‌h‌i‌s‌m (f‌p‌f a‌u‌t‌o‌m‌o‌r‌p‌h‌i‌s‌m) o‌f a g‌r‌o‌u‌p t‌o b‌e a c‌o‌m‌m‌u‌t‌i‌n‌g a‌u‌t‌o‌m‌o‌r‌p‌h‌i‌s‌m. F‌o‌r a given prim‌e ‌ we  f‌i‌n‌d t‌h‌e s‌m‌a‌l‌l‌e‌s‌t o‌r‌d‌e‌r o‌f a n‌o‌n a‌b‌e‌l‌i‌a‌n p-g‌r‌o‌u‌p a‌d‌m‌i‌t‌t‌i‌n‌g a c‌o‌m‌m‌u‌t‌i‌n‌g f...

متن کامل

Fixed points of endomorphisms of graph groups

It is shown, for a given graph group G, that the fixed point subgroup Fix' is finitely generated for every endomorphism ' of G if and only if G is a free product of free abelian groups. The same conditions hold for the subgroup of periodic points. Similar results are obtained for automorphisms if the dependence graph of G is a transitive forest.

متن کامل

Free-by-cyclic groups have solvable conjugacy problem

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one of P. Brinkmann that one can determine whether two cyclic words in a free group are mapped to each other by some power of a given automorphism. The algorithm ...

متن کامل

Free-by-cyclic Groups Have Solvable Conjugacy Problem

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one of P. Brinkmann that one can determine whether two cyclic words in a free group are mapped to each other by some power of a given automorphism. We also solve ...

متن کامل

Groups with Finitely Many Conjugacy Classes and Their Automorphisms

We combine classical methods of combinatorial group theory with the theory of small cancellations over relatively hyperbolic groups to construct finitely generated torsion-free groups that have only finitely many classes of conjugate elements. Moreover, we present several results concerning embeddings into such groups. As another application of these techniques, we prove that every countable gr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003